Recognizing Berge Graphs
نویسندگان
چکیده
A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|). This is independent of the recent proof of the strong perfect graph conjecture.
منابع مشابه
Recognizing Dart - Free Perfect Graphs 1317
A graph G is called a Berge graph if neither G nor its complement contains a chordless cycle whose length is odd and at least five; what we call a dart is the graph with vertices u, v, w, x, y and edges uv, vw, uy, vy, wy, xy; a graph is called dart-free if it has no induced subgraph isomorphic to the dart. We present a polynomial-time algorithm to recognize dart-free Berge graphs; this algorit...
متن کاملWell-covered graphs and extendability
A graph is k-extendable if every independent set of size k is contained in a maximum independent set. This generalizes the concept of a B-graph (i.e. I-extendable graph) introduced by Berge and the concept of a well-covered graph (i.e. k-extendable for every integer k) introduced by Plummer. For various graph families we present some characterizations of well-covered and k-extendable graphs. We...
متن کاملChair-Free Berge Graphs Are Perfect
A graph G is called Berge if neither G nor its complement contains a chordless cycle with an odd number of nodes. The famous Berge’s Strong Perfect Graph Conjecture asserts that every Berge graph is perfect. A chair is a graph with nodes {a, b, c, d, e} and edges {ab, bc, cd, eb}. We prove that a Berge graph with no induced chair (chair-free) is perfect or, equivalently, that the Strong Perfect...
متن کاملCovering a cubic graph by 5 perfect matchings
Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjecture holds for two classes of cubic graphs, cubic graphs with a circuit missing only one vertex and bridgeless cubic graphs with a 2-factor consisting of two circuits. The first part of this result implies that Berge ...
متن کاملTurán numbers for Berge - hypergraphs and related 1 extremal problems
4 Let F be a graph. We say that a hypergraph H is a Berge-F if there is a bijection 5 f : E(F )→ E(H) such that e ⊆ f(e) for every e ∈ E(F ). Note that Berge-F actually 6 denotes a class of hypergraphs. The maximum number of edges in an n-vertex r-graph 7 with no subhypergraph isomorphic to any Berge-F is denoted exr(n,Berge-F ). In this 8 paper we establish new upper and lower bounds on exr(n,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 25 شماره
صفحات -
تاریخ انتشار 2005